翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク covector mapping principle ： ウィキペディア英語版 covector mapping principle The covector mapping principle is a special case of Riesz' representation theorem, which is a fundamental theorem in functional analysis. The name was coined by Ross and co-workers,〔Ross, I. M., “A Historical Introduction to the Covector Mapping Principle,” Proceedings of the 2005 AAS/AIAA Astrodynamics Specialist Conference, August 7–11, 2005 Lake Tahoe, CA. AAS 05-332.〕〔 Q. Gong, I. M. Ross, W. Kang, F. Fahroo, Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control, Computational Optimization and Applications, Vol. 41, pp. 307–335, 2008〕 〔Ross, I. M. and Fahroo, F., “Legendre Pseudospectral Approximations of Optimal Control Problems,” Lecture Notes in Control and Information Sciences, Vol. 295, Springer-Verlag, New York, 2003, pp 327–342.〕〔Ross, I. M. and Fahroo, F., “Discrete Verification of Necessary Conditions for Switched Nonlinear Optimal Control Systems,” Proceedings of the American Control Conference, June 2004, Boston, MA〕〔Ross, I. M. and Fahroo, F., “A Pseudospectral Transformation of the Covectors of Optimal Control Systems,” Proceedings of the First IFAC Symposium on System Structure and Control, Prague, Czech Republic, 29–31 August 2001.〕〔W. Kang, I. M. Ross, Q. Gong, Pseudospectral optimal control and its convergence theorems, Analysis and Design of Nonlinear Control Systems, Springer, pp.109–124, 2008.〕 It provides conditions under which dualization can be commuted with discretization in the case of computational optimal control. ==Description== An application of Pontryagin's minimum principle to Problem $B$, a given optimal control problem generates a boundary value problem. According to Ross, this boundary value problem is a Pontryagin lift and is represented as Problem $B^\backslash lambda$. Now suppose one discretizes Problem $B^\backslash lambda$. This generates Problem$B^$ where $N$ represents the number of discrete pooints. For convergence, it is necessary to prove that as :$N\; \backslash to\; \backslash infty,\; \backslash quad\; \backslash text\; B^\; \backslash to\; \backslash text\; B^\backslash lambda$ In the 1960s Kalman and others 〔Bryson, A.E. and Ho, Y.C. Applied optimal control. Hemisphere, Washington, DC, 1969.〕 showed that solving Problem $B^$ is extremely difficult. This difficulty, known as the curse of complexity,〔Ross, I. M. A Primer on Pontryagin's Principle in Optimal Control. Collegiate Publishers. Carmel, CA, 2009. ISBN 978-0-9843571-0-9.〕 is complementary to the curse of dimensionality. In a series of papers starting in the late 1990s, Ross and Fahroo showed that one could arrive at a solution to Problem $B^$ (and hence Problem $B$) more easily by discretizing first (Problem $B^$) and dualizing afterwards (Problem $B^$). The sequence of operations must be done carefully to ensure consistency and convergence. The covector mapping principle asserts that a covector mapping theorem can be discovered to map the solutions of Problem $B^$ to Problem $B^$ thus completing the circuit. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「covector mapping principle」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.